A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data
نویسندگان
چکیده
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to the setting of positive timed strings (or time-stamped event sequences). An DRTA can be seen as a deterministic finite state automaton (DFA) with time constraints. Because DRTAs model time using numbers, they can be exponentially more compact than equivalent DFA models that model time using states. We use a new likelihood-ratio statistical test for checking consistency in the RTI algorithm. The result is the RTI+ algorithm, which stands for real-time identification from positive data. RTI+ is an efficient algorithm for identifying DRTAs from positive data. We show using artificial data that RTI+ is capable of identifying sufficiently large DRTAs in order to identify real-world real-time systems.
منابع مشابه
A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data1
Timed automata (TAs) are finite state models that represent timed events using an explicit notion of time, i.e., using numbers. They can be used to model and reason about real-time systems. In these system, each occurrence of a symbol (event) is associated with a time value, i.e., its time of occurrence. TAs can be used to accept or generate a sequence (a1, t1)(a2, t2)(a3, t3) . . . (an, tn) of...
متن کاملProbabilistic Real-Time Rewrite Theories and Their Expressive Power
Unbounded data structures, advanced functions and data types, and/or different forms of communication are often needed to model large and complex probabilistic real-time systems such as wireless sensor network algorithms. Furthermore, it is natural to model distributed probabilistic real-time systems in an object-oriented style, including using subclass inheritance and dynamic object and messag...
متن کاملImplicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?
In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...
متن کاملProbabilistic Deterministic Infinite Automata
We propose a novel Bayesian nonparametric approach to learning with probabilistic deterministic finite automata (PDFA). We define a PDFA with an infinite number of states (probabilistic deterministic infinite automata, or PDIA) and show how to average over its connectivity structure and state-specific emission distributions. Given a finite training sequence, posterior inference in the PDIA can ...
متن کاملLearning Probabilistic Residual Finite State Automata
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. We show that this class can be characterized by a simple intrinsic property of the stochastic languages they generate (the set of residual languages is finitely generated) and that it admits canonical minimal forms. We prove that there are more languages generated by PRFA than by Probabilistic Dete...
متن کامل